Pattern avoidance by palindromes
نویسندگان
چکیده
We show that every avoidable pattern can be avoided by an infinite sequence of palindromes over a fixed finite alphabet. © 2009 Elsevier B.V. All rights reserved.
منابع مشابه
Finding approximate palindromes in strings
We introduce a novel de nition of approximate palindromes in strings, and provide an algorithm to nd all maximal approximate palindromes in a string with up to k errors. Our de nition is based on the usual edit operations of approximate pattern matching, and the algorithm we give, for a string of size n on a xed alphabet, runs in O(kn) time. We also discuss two implementationrelated improvement...
متن کاملMolecular evolution of bacteriophages: evidence of selection against the recognition sites of host restriction enzymes.
Restriction enzymes produced by bacteria serve as a defense against invading bacteriophages, and so phages without other protection would be expected to undergo selection to eliminate recognition sites for these enzymes from their genomes. The observed frequencies of all restriction sites in the genomes of all completely sequenced DNA phages (T7, lambda, phi X174, G4, M13, f1, fd, and IKe) have...
متن کاملN ov 2 00 7 Finite Automata , Palindromes , Patterns , and Borders
Given a language L and a nondeterministic finite automaton M , we consider whether we can determine efficiently (in the size of M) if M accepts at least one word in L, or infinitely many words. Given that M accepts at least one word in L, we consider how long the shortest word can be. The languages L that we examine include the palindromes, the non-palindromes, the k-powers, the non-k-powers, t...
متن کاملShape Palindromes: Analysis of Intrinsic Symmetries in 2D Articulated Shapes
Analysis of intrinsic symmetries of non-rigid and articulated shapes is an important problem in pattern recognition with numerous applications ranging from medicine to computational aesthetics. Considering articulated planar shapes as closed curves, we show how to represent their extrinsic and intrinsic symmetries as self-similarities of local descriptor sequences, which in turn have simple int...
متن کاملLooking for All Palindromes in a String
A palindrome is a string of the form αα', where α and α' are also strings and reverse to each other. The problem of the paper is defined as follows: given a string S of length n, find all palindromes occurring in the given string S. In the paper, we present an algorithm based on suffix trees to find palindromes. Our algorithm will find all maximum palindromes which are not contained in any othe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 410 شماره
صفحات -
تاریخ انتشار 2009